0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n027.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 02:12:21 EDT 2022
0.13/0.35	% CPUTime    : 
0.20/0.48	Running higher-order on 8 cores theorem proving
0.20/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.48	# Version: 3.0pre003-ho
0.20/0.49	# Preprocessing class: HSSSSMSSMLMNHSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.49	# Starting new_ho_10 with 600s (5) cores
0.20/0.49	# Starting sh5l with 120s (1) cores
0.20/0.49	# Starting new_bool_1 with 120s (1) cores
0.20/0.49	# Starting new_bool_2 with 120s (1) cores
0.20/0.49	# sh5l with pid 14400 completed with status 0
0.20/0.49	# Result found by sh5l
0.20/0.49	# Preprocessing class: HSSSSMSSMLMNHSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.49	# Starting new_ho_10 with 600s (5) cores
0.20/0.49	# Starting sh5l with 120s (1) cores
0.20/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.49	# ...ProofStateSinE()=5/27
0.20/0.49	# Search class: HGHNF-FFSF22-SHSSMFNN
0.20/0.49	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.20/0.49	# Starting new_ho_10 with 73s (1) cores
0.20/0.49	# new_ho_10 with pid 14405 completed with status 0
0.20/0.49	# Result found by new_ho_10
0.20/0.49	# Preprocessing class: HSSSSMSSMLMNHSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.49	# Starting new_ho_10 with 600s (5) cores
0.20/0.49	# Starting sh5l with 120s (1) cores
0.20/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.49	# ...ProofStateSinE()=5/27
0.20/0.49	# Search class: HGHNF-FFSF22-SHSSMFNN
0.20/0.49	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.20/0.49	# Starting new_ho_10 with 73s (1) cores
0.20/0.49	# Preprocessing time       : 0.001 s
0.20/0.49	# Presaturation interreduction done
0.20/0.49	
0.20/0.49	# Proof found!
0.20/0.49	# SZS status Theorem
0.20/0.49	# SZS output start CNFRefutation
0.20/0.49	thf(decl_22, type, mrel: mworld > mworld > $o).
0.20/0.49	thf(decl_23, type, mactual: mworld).
0.20/0.49	thf(decl_24, type, mlocal: (mworld > $o) > $o).
0.20/0.49	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_32, type, mforall_di: ($i > mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_33, type, mexists_di: ($i > mworld > $o) > mworld > $o).
0.20/0.49	thf(decl_34, type, set_equal: $i > $i > mworld > $o).
0.20/0.49	thf(decl_35, type, element: $i > $i > mworld > $o).
0.20/0.49	thf(decl_36, type, esk1_0: $i).
0.20/0.49	thf(decl_37, type, esk2_0: $i).
0.20/0.49	thf(decl_38, type, esk3_2: $i > $i > $i).
0.20/0.49	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mlocal_def)).
0.20/0.49	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mequiv_def)).
0.20/0.49	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:((X6 @ X7 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mforall_di_def)).
0.20/0.49	thf(pel43_1, axiom, (mlocal @ (mforall_di @ (^[X7:$i]:(mforall_di @ (^[X9:$i]:(mequiv @ (set_equal @ X7 @ X9) @ (mforall_di @ (^[X10:$i]:(mequiv @ (element @ X10 @ X7) @ (element @ X10 @ X9)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', pel43_1)).
0.20/0.49	thf(pel43, conjecture, (mlocal @ (mforall_di @ (^[X7:$i]:(mforall_di @ (^[X9:$i]:(mequiv @ (set_equal @ X7 @ X9) @ (set_equal @ X9 @ X7))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', pel43)).
0.20/0.49	thf(c_0_5, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.20/0.49	thf(c_0_6, plain, ((mequiv)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
0.20/0.49	thf(c_0_7, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
0.20/0.49	thf(c_0_8, plain, ![X15:$i, X14:$i]:(((set_equal @ X15 @ X14 @ mactual)<=>![X13:$i]:(((element @ X13 @ X15 @ mactual)<=>(element @ X13 @ X14 @ mactual))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[pel43_1]), c_0_5]), c_0_6]), c_0_7])).
0.20/0.49	thf(c_0_9, negated_conjecture, ~(![X12:$i, X11:$i]:(((set_equal @ X12 @ X11 @ mactual)<=>(set_equal @ X11 @ X12 @ mactual)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel43])]), c_0_5]), c_0_6]), c_0_7])).
0.20/0.49	thf(c_0_10, plain, ![X18:$i, X19:$i, X20:$i, X21:$i, X22:$i, X23:$i]:((((~(element @ X20 @ X18 @ mactual)|(element @ X20 @ X19 @ mactual)|~(set_equal @ X18 @ X19 @ mactual))&(~(element @ X21 @ X19 @ mactual)|(element @ X21 @ X18 @ mactual)|~(set_equal @ X18 @ X19 @ mactual)))&((~(element @ (esk3_2 @ X22 @ X23) @ X22 @ mactual)|~(element @ (esk3_2 @ X22 @ X23) @ X23 @ mactual)|(set_equal @ X22 @ X23 @ mactual))&((element @ (esk3_2 @ X22 @ X23) @ X22 @ mactual)|(element @ (esk3_2 @ X22 @ X23) @ X23 @ mactual)|(set_equal @ X22 @ X23 @ mactual))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])).
0.20/0.49	thf(c_0_11, negated_conjecture, ((~(set_equal @ esk1_0 @ esk2_0 @ mactual)|~(set_equal @ esk2_0 @ esk1_0 @ mactual))&((set_equal @ esk1_0 @ esk2_0 @ mactual)|(set_equal @ esk2_0 @ esk1_0 @ mactual))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
0.20/0.49	thf(c_0_12, plain, ![X7:$i, X9:$i, X10:$i]:(((element @ X7 @ X10 @ mactual)|~((element @ X7 @ X9 @ mactual))|~((set_equal @ X9 @ X10 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.49	thf(c_0_13, negated_conjecture, ((set_equal @ esk1_0 @ esk2_0 @ mactual)|(set_equal @ esk2_0 @ esk1_0 @ mactual)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.49	thf(c_0_14, plain, ![X7:$i, X10:$i, X9:$i]:(((element @ X7 @ X10 @ mactual)|~((element @ X7 @ X9 @ mactual))|~((set_equal @ X10 @ X9 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.49	thf(c_0_15, negated_conjecture, ![X7:$i]:(((element @ X7 @ esk2_0 @ mactual)|~((element @ X7 @ esk1_0 @ mactual)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
0.20/0.49	thf(c_0_16, plain, ![X7:$i, X9:$i]:(((element @ (esk3_2 @ X7 @ X9) @ X7 @ mactual)|(element @ (esk3_2 @ X7 @ X9) @ X9 @ mactual)|(set_equal @ X7 @ X9 @ mactual))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.49	thf(c_0_17, plain, ![X7:$i, X9:$i]:(((set_equal @ X7 @ X9 @ mactual)|~((element @ (esk3_2 @ X7 @ X9) @ X7 @ mactual))|~((element @ (esk3_2 @ X7 @ X9) @ X9 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.49	thf(c_0_18, negated_conjecture, ![X7:$i]:(((set_equal @ esk2_0 @ esk1_0 @ mactual)|(element @ X7 @ esk1_0 @ mactual)|~((element @ X7 @ esk2_0 @ mactual)))), inference(spm,[status(thm)],[c_0_14, c_0_13])).
0.20/0.49	thf(c_0_19, negated_conjecture, ![X7:$i]:(((element @ (esk3_2 @ X7 @ esk1_0) @ esk2_0 @ mactual)|(element @ (esk3_2 @ X7 @ esk1_0) @ X7 @ mactual)|(set_equal @ X7 @ esk1_0 @ mactual))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.49	thf(c_0_20, negated_conjecture, ![X7:$i]:(((set_equal @ esk2_0 @ esk1_0 @ mactual)|(set_equal @ X7 @ esk1_0 @ mactual)|~((element @ (esk3_2 @ X7 @ esk1_0) @ esk2_0 @ mactual))|~((element @ (esk3_2 @ X7 @ esk1_0) @ X7 @ mactual)))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.20/0.49	thf(c_0_21, negated_conjecture, ((element @ (esk3_2 @ esk2_0 @ esk1_0) @ esk2_0 @ mactual)|(set_equal @ esk2_0 @ esk1_0 @ mactual)), inference(ef,[status(thm)],[c_0_19])).
0.20/0.49	thf(c_0_22, negated_conjecture, ![X7:$i]:(((element @ (esk3_2 @ esk1_0 @ X7) @ esk2_0 @ mactual)|(element @ (esk3_2 @ esk1_0 @ X7) @ X7 @ mactual)|(set_equal @ esk1_0 @ X7 @ mactual))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.49	thf(c_0_23, negated_conjecture, (~((set_equal @ esk1_0 @ esk2_0 @ mactual))|~((set_equal @ esk2_0 @ esk1_0 @ mactual))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.49	thf(c_0_24, negated_conjecture, (set_equal @ esk2_0 @ esk1_0 @ mactual), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_21])).
0.20/0.49	thf(c_0_25, negated_conjecture, ((element @ (esk3_2 @ esk1_0 @ esk2_0) @ esk2_0 @ mactual)|(set_equal @ esk1_0 @ esk2_0 @ mactual)), inference(ef,[status(thm)],[c_0_22])).
0.20/0.49	thf(c_0_26, negated_conjecture, ~((set_equal @ esk1_0 @ esk2_0 @ mactual)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])])).
0.20/0.49	thf(c_0_27, negated_conjecture, (element @ (esk3_2 @ esk1_0 @ esk2_0) @ esk2_0 @ mactual), inference(sr,[status(thm)],[c_0_25, c_0_26])).
0.20/0.49	thf(c_0_28, negated_conjecture, ~((element @ (esk3_2 @ esk1_0 @ esk2_0) @ esk1_0 @ mactual)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_27]), c_0_26])).
0.20/0.49	thf(c_0_29, negated_conjecture, ![X7:$i]:(((element @ X7 @ esk1_0 @ mactual)|~((element @ X7 @ esk2_0 @ mactual)))), inference(spm,[status(thm)],[c_0_12, c_0_24])).
0.20/0.49	thf(c_0_30, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_27])]), ['proof']).
0.20/0.49	# SZS output end CNFRefutation
0.20/0.49	# Parsed axioms                        : 27
0.20/0.49	# Removed by relevancy pruning/SinE    : 22
0.20/0.49	# Initial clauses                      : 6
0.20/0.49	# Removed in clause preprocessing      : 0
0.20/0.49	# Initial clauses in saturation        : 6
0.20/0.49	# Processed clauses                    : 33
0.20/0.49	# ...of these trivial                  : 0
0.20/0.49	# ...subsumed                          : 5
0.20/0.49	# ...remaining for further processing  : 28
0.20/0.49	# Other redundant clauses eliminated   : 0
0.20/0.49	# Clauses deleted for lack of memory   : 0
0.20/0.49	# Backward-subsumed                    : 1
0.20/0.49	# Backward-rewritten                   : 7
0.20/0.49	# Generated clauses                    : 36
0.20/0.49	# ...of the previous two non-redundant : 25
0.20/0.49	# ...aggressively subsumed             : 0
0.20/0.49	# Contextual simplify-reflections      : 3
0.20/0.49	# Paramodulations                      : 29
0.20/0.49	# Factorizations                       : 6
0.20/0.49	# NegExts                              : 0
0.20/0.49	# Equation resolutions                 : 0
0.20/0.49	# Propositional unsat checks           : 0
0.20/0.49	#    Propositional check models        : 0
0.20/0.49	#    Propositional check unsatisfiable : 0
0.20/0.49	#    Propositional clauses             : 0
0.20/0.49	#    Propositional clauses after purity: 0
0.20/0.49	#    Propositional unsat core size     : 0
0.20/0.49	#    Propositional preprocessing time  : 0.000
0.20/0.49	#    Propositional encoding time       : 0.000
0.20/0.49	#    Propositional solver time         : 0.000
0.20/0.49	#    Success case prop preproc time    : 0.000
0.20/0.49	#    Success case prop encoding time   : 0.000
0.20/0.49	#    Success case prop solver time     : 0.000
0.20/0.49	# Current number of processed clauses  : 13
0.20/0.49	#    Positive orientable unit clauses  : 3
0.20/0.49	#    Positive unorientable unit clauses: 0
0.20/0.49	#    Negative unit clauses             : 2
0.20/0.49	#    Non-unit-clauses                  : 8
0.20/0.49	# Current number of unprocessed clauses: 1
0.20/0.49	# ...number of literals in the above   : 2
0.20/0.49	# Current number of archived formulas  : 0
0.20/0.49	# Current number of archived clauses   : 15
0.20/0.49	# Clause-clause subsumption calls (NU) : 41
0.20/0.49	# Rec. Clause-clause subsumption calls : 26
0.20/0.49	# Non-unit clause-clause subsumptions  : 8
0.20/0.49	# Unit Clause-clause subsumption calls : 10
0.20/0.49	# Rewrite failures with RHS unbound    : 0
0.20/0.49	# BW rewrite match attempts            : 9
0.20/0.49	# BW rewrite match successes           : 3
0.20/0.49	# Condensation attempts                : 33
0.20/0.49	# Condensation successes               : 0
0.20/0.49	# Termbank termtop insertions          : 1662
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.006 s
0.20/0.49	# System time              : 0.002 s
0.20/0.49	# Total time               : 0.008 s
0.20/0.49	# Maximum resident set size: 1928 pages
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.009 s
0.20/0.49	# System time              : 0.002 s
0.20/0.49	# Total time               : 0.011 s
0.20/0.49	# Maximum resident set size: 1744 pages
0.20/0.49	EOF